Simple Algorithm for Partial Quantum Search
نویسندگان
چکیده
منابع مشابه
Group Theoretical Formulation of Quantum Partial Search Algorithm
Searching and sorting used as a subroutine in many important algorithms. Quantum algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster, this is partial search. An example is the following: exact address of the target item is given by a sequence of many ...
متن کاملQuantum Search Algorithm with more Reliable Behaviour using Partial Diffusion
In this paper, we will use a quantum operator which performs the inversion about the mean operation only on a subspace of the system (Partial Diffusion Operator) to propose a quantum search algorithm runs in O( √ N/M ) for searching unstructured list of size N with M matches such that, 1 ≤ M ≤ N . We will show that the performance of the algorithm is more reliable than known quantum search algo...
متن کاملImproved Cuckoo Search Algorithm for Global Optimization
The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...
متن کاملAn alternate algorithm for directed quantum search
We present a new algorithm for directed quantum search, which is superior to the Phase-π/3 search algorithm [5] in several aspects. In particular, our algorithm does not require complex phases and achieves the optimal reduction in error probability, from ǫ to ǫ2q+1, for all positive integer values q of oracle queries. (The Phase-π/3 algorithm, requires q = (3n − 1)/2, with n a positive integer....
متن کاملAdiabatic quantum algorithm for search engine ranking.
We propose an adiabatic quantum algorithm for generating a quantum pure state encoding of the PageRank vector, the most widely used tool in ranking the relative importance of internet pages. We present extensive numerical simulations which provide evidence that this algorithm can prepare the quantum PageRank state in a time which, on average, scales polylogarithmically in the number of web page...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2006
ISSN: 1570-0755,1573-1332
DOI: 10.1007/s11128-005-0004-z